Metaheuristics International Conference ? ? - 1 GRASP heuristic for the strip packing problem ∗
نویسندگان
چکیده
The rectangular Strip Packing Problem (SPP) consists of packing a given set of rectangles in a rectangular strip with fixed width w and variable height minimizing the height of the packing. In this work we propose a ”Greedy Randomized and Adaptive Constructive” heuristic, a GRASP metaheuristic without the post-processing phase, for the SPP in the version where the rectangles can be freely rotated. In the next section, we define the problem. The adaptation of the constructive phase of GRASP to the SPP is described in section 3. Final sections describe the computational experience and the conclusions.
منابع مشابه
Reactive GRASP for the strip-packing problem
This paper presents a greedy randomized adaptive search procedure (GRASP) for the strip packing problem, which is the problem of placing a set of rectangular pieces into a strip of a given width and infinite length so as to minimize the required length. We investigate several strategies for the constructive and improvement phases and several choices for critical search parameters. We perform ex...
متن کاملA new metaheuristic genetic-based placement algorithm for 2D strip packing
Given a container of fixed width, infinite height and a set of rectangular block, the 2D-strip packing problem consists of orthogonally placing all the rectangles such that the height is minimized. The position is subject to confinement of no overlapping of blocks. The problem is a complex NP-hard combinatorial optimization, thus a heuristic based on genetic algorithm is proposed to solve it. I...
متن کاملGRASP-VNS hybrid for the Strip Packing Problem
In this work we consider an hybrid metaheuristic approach to solve the Strip Packing Problem. In the hybrid algorithm, we use an Variable Neighbourhood Search (VNS) to improve the quality of part of the solution obtained with a Greedy Randomized Adaptive Search Procedure (GRASP). Then, the results achieved with the hybrid method are compared with those existing in the literature. From these res...
متن کاملSolving the Rectangle Packing Problem by an Iterative Hybrid Heuristic
In this paper we propose an iterative hybrid heuristic approach consisting of two phases to solve the Rectangle Packing Problem. In the first phase, a strip width value W is fixed and the corresponding Strip Packing Problem is solved using an efficient hybrid GRASP-VNS heuristic. In the second one, a new value W is determined. The above phases are repeated until the stopping condition is met. T...
متن کاملHeuristics for the strip packing problem with unloading constraints
This article addresses the Strip Packing Problem with Unloading Constraints (SPU). In this problem, we are given a strip of fixed width and unbounded height, and n items of C different classes. As in the well-known two-dimensional Strip Packing problem, we have to pack all items minimizing the used height, but now we have the additional constraint that items of higher classes cannot block the w...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2005